Integer Concave Cocirculations and Honeycombs
نویسنده
چکیده
A convex triangular grid is a planar digraph G embedded in the plane so that each bounded face is an equilateral triangle with three edges and their union R forms a convex polygon. A function h : E(G) → R is called a concave cocirculation if h(e) = g(v) − g(u) for each edge e = (u, v), where g is a concave function on R which is affinely linear within each bounded face of G. Knutson and Tao obtained an integrality result on so-called honeycombs implying that if an integer-valued function on the boundary edges is extendable to a concave cocirculation, then it is extendable to an integer one. We show a sharper property: for any concave cocirculation h, there exists an integer concave cocirculation h′ satisfying h′(e) = h(e) for each edge e with h(e) ∈ Z contained in the boundary or in a bounded face where h is integer on all edges. Also relevant polyhedral and algorithmic results are presented.
منابع مشابه
3 Concave Cocirculations in a Triangular Grid
Let G = (V (G), E(G)) be a planar digraph embedded in the plane in which all inner faces are equilateral triangles (with three edges in each), and let the union R of these faces forms a convex polygon. The question is: given a function σ on the boundary edges of G, does there exist a concave function f on R which is affinely linear within each bounded face and satisfies f(v)− f(u) = σ(e) for ea...
متن کاملRESOLUTION METHOD FOR MIXED INTEGER LINEAR MULTIPLICATIVE-LINEAR BILEVEL PROBLEMS BASED ON DECOMPOSITION TECHNIQUE
In this paper, we propose an algorithm base on decomposition technique for solvingthe mixed integer linear multiplicative-linear bilevel problems. In actuality, this al-gorithm is an application of the algorithm given by G. K. Saharidis et al for casethat the rst level objective function is linear multiplicative. We use properties ofquasi-concave of bilevel programming problems and decompose th...
متن کاملOn Approximation Algorithms for Concave Mixed-Integer Quadratic Programming
Concave Mixed-Integer Quadratic Programming is the problem of minimizing a concave quadratic polynomial over the mixed-integer points in a polyhedral region. In this work we describe two algorithms that find an -approximate solution to a Concave Mixed-Integer Quadratic Programming problem. The running time of the proposed algorithms is polynomial in the size of the problem and in 1/ , provided ...
متن کاملComplete Solutions to Mixed Integer Programming
This paper considers a new canonical duality theory for solving mixed integer quadratic programming problem. It shows that this well-known NP-hard problem can be converted into concave maximization dual problems without duality gap. And the dual problems can be solved, under certain conditions, by polynomial algorithms.
متن کاملConcave Quadratic Cuts for Mixed-Integer Quadratic Problems
The technique of semidefinite programming (SDP) relaxation can be used to obtain a nontrivial bound on the optimal value of a nonconvex quadratically constrained quadratic program (QCQP). We explore concave quadratic inequalities that hold for any vector in the integer lattice Z, and show that adding these inequalities to a mixed-integer nonconvex QCQP can improve the SDP-based bound on the opt...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2004